Automation of Higher-Order Logic
نویسندگان
چکیده
3 Church’s simple theory of types (classical higher-order logic) 8 3.1 The λ-calculus as computation (middle and late 1930s) . . . . . . 8 3.2 Mixing λ-calculus and logic . . . . . . . . . . . . . . . . . . . . . 9 3.3 Simple types and typed λ-terms . . . . . . . . . . . . . . . . . . . 9 3.4 Formulas as terms of type o . . . . . . . . . . . . . . . . . . . . . 11 3.5 Elementary type theory . . . . . . . . . . . . . . . . . . . . . . . 12 3.6 Simple type theory . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.7 Variants of elementary and simple type theory . . . . . . . . . . 14 3.8 An example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.9 Church used different syntax not adopted here . . . . . . . . . . 15
منابع مشابه
Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic
In this paper, we present an embedding of higher-order nominal modal logic into classical higher-order logic and study its automation. There exists no automated theorem prover for first-order or higherorder nominal logic at the moment, hence, this is the first automation for this kind of logic. In our work, we focus on nominal tense logic and have successfully proven some first theorems.
متن کاملTranslating Higher-Order Problems to First-Order Clauses
Proofs involving large specifications are typically carried out through interactive provers that use higher-order logic. A promising approach to improve the automation of interactive provers is by integrating them with automatic provers, which are usually based on first-order logic. Consequently, it is necessary to translate higher-order logic formulae to first-order form. This translation shou...
متن کاملAutomating Recursive Type Deenitions in Higher Order Logic 1
The expressive power of higher order logic makes it possible to deene a wide variety of types within the logic and to prove theorems that state the properties of these types concisely and abstractly. This paper contains a tutorial introduction to the logical basis for such type deenitions. Examples are given of the formal deenitions in logic of several simple types. A method is then described f...
متن کاملAutomating Recursive Type Definitions in Higher Order Logic
The expressive power of higher order logic makes it possible to define a wide variety of types within the logic and to prove theorems that state the properties of these types concisely and abstractly. This paper contains a tutorial introduction to the logical basis for such type definitions. Examples are given of the formal definitions in logic of several simple types. A method is then describe...
متن کاملVerifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning systems for simple type type theory exist that can be uniformly employed for reasoning within and about embedded logics. In this paper we focus on reasoning about modal logics and exploit our framework for the automated ve...
متن کاملTranslating HOL functions to hardware
Delivering error-free products is still a major challenge for hardware and software engineers. Due to the increasingly growing complexity of computing systems, there is a demand for higher levels of automation in formal verification. This dissertation proposes an approach to generate formally verified circuits automatically. The main outcome of our project is a compiler implemented on top of th...
متن کامل